Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于聚类算法的多无人机系统任务分配

针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...     

Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

New heuristic methods for the capacitated multi‐facility Weber problem

In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?_p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006     

Probabilistic solution and bounds for serial inventory systems with discounted and average costs

We consider the infinite horizon serial inventory system with both average cost and discounted cost criteria. The optimal echelon base‐stock levels are obtained in terms of only probability distributions of leadtime demands. This analysis yields a novel approach for developing bounds and heuristics for optimal inventory control polices. In addition to deriving the known bounds in literature, we develop several new upper bounds for both average cost and discounted cost models. Numerical studies show that the bounds and heuristic are very close to optimal.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

一种不需要特征值分解的MUSIC方法

MUSIC方法是空间谱估计中经典的子空间方法。提出了一种构造参考信号的预处理模型,提出了一种适合于MUSIC方法的多级维纳滤波结构。新方法避免了采样数据二阶统计的特征值分解,降低了运算量。仿真结果证明了方法的有效性。     

遗传算法在防空导弹火力优化分配中的应用

介绍了遗传算法的基本原理、算法设计并结合遗传算法主要解决了如何把目标分配给火力单元的问题,编写了相应的程序,并给出了一个基于遗传算法的火力优化分配方案。     

基于改进直方图算法的雷达信号参数特征提取研究

雷达信号特征提取是雷达信号识别中的重要组成部分,直接影响到识别效果的好坏。在研究直方图算法分析雷达信号特征的基础上,提出2种改进的直方图算法:截断直方图算法和窄带直方图算法,并用仿真实验分析影响算法性能的4个因素,验证了直方图算法提取雷达信号参数特征的有效性。     

RBF网络用于战车火控系统弹道解算的方法

弹道解算问题对战车火控系统的性能有着直接的影响.传统的弹道解算方法在精度和实时性方面都存在一定的局限性.为了提高解算精度、战车首发命中率和解算的实时性,基于RBF网络的函数逼近及预测能力,将RBF网络用于弹道解算,对传统算法进行优化,得到了新的弹道解算方法.最后对所提方法进行了仿真,发现新方法在解算精度没有降低的条件下,大大提高了弹道解算的实时性.     

天基支援下区域反导组网作战链路规划

天基信息支援下区域反导组网作战各系统实现互连、互通、互操作的关键是战术信息分发系统,而该系统中存在着多种类型的数据链路,这些链路之间又存在着各种约束条件,因此科学合理的对这些链路进行规划是系统实现的重要工作之一.建立并提出了天基信息支援下区域反导组网作战战术信息分发系统数据链路的规划模型和一种新的解算方法,为该系统数据链路的规划提供了理论依据.